Visual Programming without Procedures

نویسنده

  • Amir Michail
چکیده

In this paper, we motivate the idea of visual programming without procedures or functions. If a visual program contains several similar cases, then the user need only implement one case and use built-in domain sensitive algorithms that “imitate” the implemented case to automatically produce visual code for the similar cases. This work contributes to visual programming research in two ways. First, it eliminates the need for the user to structure visual code. Second, it reduces the complexity of the visualizations thus making the visual code more apparent. We demonstrate our method using Opsis, a system we built to teach binary tree algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using MOLP based procedures to solve DEA problems

Data envelopment analysis (DEA) is a technique used to evaluate the relative efficiency of comparable decision making units (DMUs) with multiple input-output. It computes a scalar measure of efficiency and discriminates between efficient and inefficient DMUs. It can also provide reference units for inefficient DMUs without consideration of the decision makers’ (DMs) preferences. In this paper, ...

متن کامل

Evolutionary Computation Framework for Learning from Visual Examples

This paper investigates the use of evolutionary programming for the search of hypothesis space in visual learning tasks. The general goal of the project is to elaborate human-competitive procedures for pattern discrimination by means of learning based on the training data (set of images). In particular, the topic addressed here is the comparison between the ‘standard’ genetic programming (as de...

متن کامل

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

متن کامل

Separable programming problems with the max-product fuzzy relation equation constraints

In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...

متن کامل

Data Mining in R using Rattle

T‎his paper is a brief introduction to the concepts, methods ‎and ‎algorithms ‎for ‎data ‎mining ‎in ‎statistical ‎software R ‎using a‎ ‎package ‎named ‎Rattle. Rattle ‎provides a‎ ‎good ‎graphical ‎environment ‎to ‎perform ‎some ‎of ‎the ‎procedures ‎and ‎algorithms ‎without ‎the ‎need ‎for ‎programming. ‎Some ‎parts ‎of ‎the ‎package ‎will ‎be ‎explained ‎by a‎ ‎number ‎of ‎examples.‎ ‎ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997